منابع مشابه
Covering selfish machines
We consider the machine covering problem for selfish related machines. For a constant number of machines, m, we show a monotone polynomial time approximation scheme (PTAS) with running time that is linear in the number of jobs. It uses a new technique for reducing the number of jobs while remaining close to the optimal solution. We also present an FPTAS for the classical machine covering proble...
متن کاملCustom Computing Machines for the Set Covering Problem
We present instance-specific custom computing machines for the set covering problem. Four accelerator architectures are developed that implement branch & bound in 3-valued logic and many of the deduction techniques found in software solvers. We use set covering benchmarks from two-level logic minimization and Steiner triple systems to derive and discuss experimental results. The resulting raw s...
متن کاملSemi-online machine covering for two uniform machines
The machine covering problem deals with partitioning a sequence of jobs among a set of machines, so as to maximize the completion time of the least loaded machine. We study a semi-online variant, where jobs arrive one by one, sorted by non-increasing size. The jobs are to be processed by two uniformly related machines, with a speed ratio of q ≥ 1. Each job has to be processed continuously, in a...
متن کاملOn covering of products of T-generalized state machines
We introduce the concepts of T-generalized state machines and coverings of products of them. Also some of algebraic properties of them are investigated. Finely some products such as direct sum and sum of Tgeneralized state machines are introduced. An interesting distributive property of cascade product over the sum of Tgeneralized state machines concern to covering of T-generalized state machin...
متن کاملRule extraction from support vector machines based on consistent region covering reduction
Due to good performance in classification and regression, support vector machines have attracted much attention and become one of the most popular learning machines in last decade. As a black box, the support vector machine is difficult for users’ understanding and explanation. In many application domains including medical diagnosis or credit scoring, understandability and interpretability are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90536-o